Calculi, countermodel generation and theorem prover for strong logics of counterfactual reasoning
نویسندگان
چکیده
Abstract We present hypersequent calculi for the strongest logics in Lewis’ family of conditional systems, characterized by uniformity and total reflexivity. first a non-standard calculus, which allows syntactic proof cut elimination. then introduce standard calculi, sequents are enriched additional structures to encode plausibility formulas diamond formulas. Proof search using these is terminating, completeness shows how countermodel can be constructed from branch failed search. describe tuCLEVER, theorem prover that implements calculi. The provides decision procedure logics, it produces case failure. tuCLEVER inspired methodology leanTAP implemented Prolog. Preliminary experimental results show performances promising.1
منابع مشابه
KLMLean 1.0: a Theorem Prover for Logics of Default Reasoning
In this paper we present KLMLean 1.0, a theorem prover for some logics of default reasoning, namely Preferential logic P and Loop-Cumulative logic CL introduced by Kraus, Lehmann, and Magidor. KLMLean 1.0 implements some tableaux calculi for these logics recently introduced. It is implemented in SICStus Prolog and also comprises a graphical user interface written in Java. KLMLean 1.0 is availab...
متن کاملCounterfactual logics: natural deduction calculi and sequent calculi
Counterfactual logics, which have a long and venerable history [3, 1, 2], have been introduced to capture counterfactual sentences, i.e. conditionals of the form “if A were the case, then B would be the case”, where A is false. If we interpret counterfactuals as material conditionals, we have that all counterfactuals are trivially true and this is an unpleasant conclusion. By means of counterfa...
متن کاملKLMLean 2.0: A Theorem Prover for KLM Logics of Nonmonotonic Reasoning
We present KLMLean 2.0, a theorem prover for propositional KLM logics of nonmonotonic reasoning. KLMLean 2.0 implements some analytic tableaux calculi for these logics recently introduced. KLMLean 2.0 is inspired by the “lean” methodology, it is implemented in SICStus Prolog and it also contains a graphical interface written in Java.
متن کاملDarr – a Theorem Prover for Constrained and Rational Default Logics
Default logics represent an important class of the nonmonotonic formalisms. Using simple by powerful inference rules, called defaults, these logic systems model reasoning patterns of the form ”in the absence of information to the contrary of. . . ”, and thus formalize the default reasoning, a special type of nonmonotonic reasoning. In this paper we propose an automated system, called DARR, with...
متن کامل2 Bell ’ s Theorem and Counterfactual Reasoning
Bell’s theorem depends crucially on counterfactual reasoning, and is mistakenly interpreted as ruling out a local explanation for the correlations which can be observed between the results of measurements performed on spatially-separated quantum systems. But in fact the Everett interpretation of quantum mechanics, in the Heisenberg picture, provides an alternative local explanation for such cor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Logic and Computation
سال: 2022
ISSN: ['1465-363X', '0955-792X']
DOI: https://doi.org/10.1093/logcom/exab084